Impulse Neuron and Cellular Neural Automaton are Asymptotically Equivalent
نویسندگان
چکیده
منابع مشابه
F - Asymptotically Lacunary Equivalent Sequences
This paper presents introduce some new notions, f -asymptotically equivalent of multiple L, strong f -asymptotically equivalent of multiple L, and strong f -asymptotically lacunary equivalent of multiple L which is a natural combination of the definition for asymptotically equivalent, Statistically limit, Lacunary sequence, and Modulus function. We study some connections between the asymptotica...
متن کاملOn ∆-Asymptotically Statistical Equivalent Sequences
This paper presents new definitions which are a natural combination of the definition for asymptoticall equivalence and ∆−statistical convergence of sequences. Let θ = (k r) be a lacunary sequence. Then the sequences x and y are said to be [w] L θ,∆ −asymptotically equivalent of multiple L provided that for every ε > 0 lim r 1 h r k ∈ I r : t km (∆x k) t km (∆y k) − L ≥ ε = 0 .
متن کاملP-asymptotically Equivalent in Probability
In this paper we present the following definitions P-asymptotically equivalent probability of multiple L and P-asymptotically probability regular. In addition to these definitions we asked and provide answers for the following questions. (1) If x Probability ≈ y then what type of four dimensional matrices transformation will satisfy the following μ(Ax) Probability ≈ μ(Ay)? (2) If [x] and [y] ar...
متن کاملWhat subshifts are the limit set of a cellular automaton?
Cellular automata are the most natural discretization of dynamical systems. Their long-term behaviour is captured in their limit set, also known as the maximal attractor. We investigate what complexity limit sets can have from the point of view of language theory, and we try to give some dynamical characterizations of subshifts that are limit sets. Then, the inverse problem of determining the l...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2014
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2014-3-62-80